Conflict Tolerant Queries in AURORA

نویسندگان

  • Ling-Ling Yan
  • M. Tamer Özsu
چکیده

Conflict tolerant queries are a new way of dealing with instance level conflicts in data integrated from multiple sources. In contrast to the traditional approach of resolving such conflicts during schema integration using aggregation functions, we establish a query model and processing techniques to tolerate these conflicts at query time to a degree specified by the users. Resolutions are only performed to produce conflict-free results. Currently we support 3 levels of conflict tolerance: HighConfidence, RandomEvidence, and PossibleAtAll and allow user-defined functions to be used for conflict resolution. The approach reduces the overhead of conflict detection and resolution and lends itself to new query optimization techniques. Fundamentally, our approach allows users to handle conflict at a coarse granularity to achieve better query performance when conflict resolution requirements are relaxed and when data contain occasional conflicts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بهبود الگوریتم انتخاب دید در پایگاه داده‌‌ تحلیلی با استفاده از یافتن پرس‌ وجوهای پرتکرار

A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...

متن کامل

A Full Key Recovery Attack on HMAC-AURORA-512

In this note, we present a full key recovery attack on HMACAURORA-512 when 512-bit secret keys are used and the MAC length is 512-bit long. Our attack requires 2 queries and the off-line complexity is 2 AURORA-512 operations, which is significantly less than the complexity of the exhaustive search for a 512-bit key. The attack can be carried out with a negligible amount of memory. Our attack ca...

متن کامل

Conflict-Tolerant Switching Controllers

This paper addresses the problem of detecting and resolving conflicts between switching controllers of hybrid systems. We consider systems composed of a base system with multiple switching controllers, each of which independently control the base system dynamics so as to conform to their individual specifications. We propose a methodology for developing such systems in a modular manner based on...

متن کامل

The Design of FLEX: A Tolerant and Cooperative User Interface to Databases

FLEX is a user interface to relational databases that is tolerant of incorrect input. FLEX never rejects a query; instead, it adjusts to the level of technical expertise its users seem to possess (as judged from their input). In particular, FLEX understands formal queries; salvages incorrect queries if they include enough clues on their intended meaning; suggests educated guesees if it recogniz...

متن کامل

Stochastic Analysis of a Fault-Tolerant and Bandwidth-Efficient P2P Network

We present the design and analysis of a fault-tolerant and bandwidth-efficient Peer-to-Peer (P2P) scheme (called as WARP). WARP employs a simple and natural fault-tolerant mechanism to manage the dynamic nature of node arrivals and departures by allowing multiple physical nodes to service data mapped to a single node in the overlay. WARP’s overlay network is asymmetric (built using an underlyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999